Temporal optimization of Lagrangian perturbation schemes
نویسندگان
چکیده
The Lagrangian perturbation theory on Friedmann– Lemaı̂tre cosmologies is compared with numerical simulations (tree–, adaptive P3M– and PM codes). In previous work we have probed the large–scale performance of the Lagrangian perturbation solutions up to the third order by studying their cross–correlations with N–body simulations for various power spectra (Buchert et al. 1994, Melott et al. 1995, Weiß et al. 1996). Thereby, spatial optimization techniques were applied by (high–frequency–)filtering of the initial power spectra. In this work the novel method of temporal optimization [Shifted– Time–Approximation (STA) and Frozen–Time–Approximation (FTA)] is investigated and used. Themethod is designed to compensate the native property of Lagrangian perturbation solutions to delay the collapse of structures. The method can be treated analytically. Applying the STA and FTA prescriptions a significant improvement of the performance of Lagrangian perturbation schemes up to r.m.s density contrast of about 10 (as measured by cross–correlation, relative phase error and power– spectrum statistics) is observed. Using this tool we investigate a local study of special clustering models of dark matter as candidates for typical elements of the large–scale structure in the Universe, and so also focus on the performance of the perturbation solutions on smaller scales at high–spatial resolution. The models analyzed were presented in (Buchert et al. 1997) and allow studying typical features of the clustering process in the non–linear regime. The spatial and temporal limits of applicability of the solutions at second and third order are determined and compared with the first–order solution, which is equivalent to the “Zel’dovich approximation” (Zel’dovich 1970, 1973) for the type of initial data analyzed.
منابع مشابه
Solving a system of 2D Burgers' equations using Semi-Lagrangian finite difference schemes
In this paper, we aim to generalize semi-Lagrangian finite difference schemes for a system of two-dimensional (2D) Burgers' equations. Our scheme is not limited by the Courant-Friedrichs-Lewy (CFL) condition and therefore we can apply larger step size for the time variable. Proposed schemes can be implemented in parallel very well and in fact, it is a local one-dimensional (LOD) scheme which o...
متن کاملNonlinear Vibration Analysis of the Composite Cable using Perturbation Method and the Green-Lagrangian Nonlinear Strain
In this study, nonlinear vibration of a composite cable is investigated by considering nonlinear stress-strain relations. The composite cable is composed of an aluminum wire as reinforcement and a rubber coating as matrix. The nonlinear governing equations of motion are derived about to an initial curve and based on the fundamentals of continuum mechanics and the nonlinear Green-Lagrangian stra...
متن کاملApproximate Fenchel-Lagrangian Duality for Constrained Set-Valued Optimization Problems
In this article, we construct a Fenchel-Lagrangian ε-dual problem for set-valued optimization problems by using the perturbation methods. Some relationships between the solutions of the primal and the dual problems are discussed. Moreover, an ε-saddle point theorem is proved.
متن کاملA geometric framework for nonconvex optimization duality using augmented lagrangian functions
We provide a unifying geometric framework for the analysis of general classes of duality schemes and penalty methods for nonconvex constrained optimization problems. We present a separation result for nonconvex sets via general concave surfaces. We use this separation result to provide necessary and sufficient conditions for establishing strong duality between geometric primal and dual problems...
متن کاملpth Power Lagrangian Method for Integer Programming
When does there exist an optimal generating Lagrangian multi-plier vector (that generates an optimal solution of an integer programming problem in a Lagrangian relaxation formulation), and in cases of nonexistence, can we produce the existence in some other equivalent representation space? Under what conditions does there exist an optimal primal-dual pair in integer programming? This paper cons...
متن کامل